Auditing For Dynamic Data with User Revocation
AUTHORS
Reddi Prasadu,100-100 Department of Information technology Anil Neerukonda Institute of Technology and Sciences Visakhapatnam, Andhra Pradesh-531162, India.
ABSTRACT
We have a tendency to tend to go looking out the collusion attack at intervals the exiting theme and supply qualification economical public integrity auditing theme with secure cluster user revocation supported vector commitment and verifier-local revocation cluster signature. Development of authorization mechanisms for secure data access by an outsized community of users in Associate in Nursing open atmosphere is a crucial downside within the ever-growing web world. During this paper we have a tendency to propose a procedure dynamic trust model for user authorization, nonmoving in findings from scientific discipline. In contrast to most existing procedure trust models, this model distinguishes trusting belief in integrity from that in ability totally in numerous contexts and accounts for sound judgment within the analysis of a selected trustee by different trustors, We tend to tend to vogue a concrete theme supported the theme definition. Finally, the security and experimental analysis show that, compared with its relevant themes our theme is in addition secure and economical
KEYWORDS
Auditing, dynamic, cluster, collusion, economical, vogue, secure
REFERENCES
[1] Amazon, “Amazon simple storage service” (amazon s3). Amazon. [Online]. Available: http://aws.amazon.com/s3/, (2007).
[2] Google, Google drive. Google. [Online]. Available: http://drive.google.com/, (2005).
[3] Dropbox, “A file-storage and sharing service”. Dropbox. [Online]. Available: http://www.dropbox.com/, (2007).
[4] Mozy, “An online, data, and computer backup software”. Emic. [Online]. Available: http://www.dropbox.com/, (2007).
[5] Bitcasa, “Infinite storage”. Bitcasa. [Online]. Available: http://www.bitcasa.com/, (2011).
[6] Memopal, (2007) “Online backup”. Memopal. [Online]. Available: http://www.memopal.com/ [7] m. A. “above the clouds: a Berkeley view of cloud computing,” Technical Report, Ucbeecs, Vol. 28, pp. 1-23, February (2009).
[7] M. Rabin, “Efficient dispersal of information for security,” Journal of the ACM (jacm), vol. 36, no. 2, pp. 335-348, April (1989). (CrossRef)(Google Scholar)
[8] J. G. “The expanding digital universe: a forecast of worldwide information growth through 2010”. IDE. [online]. Available: whitepaper, (2006).(CrossRef)(Google Scholar)
[9] G. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D. Song, “Provable data possession at untrusted stores,” in Proceedings of ACM CCS, pp. 598-609October (2007), Virginia, USA.(CrossRef)(Google Scholar)
[10] Q. Wu, Y. Mu, W. Susilo, B. Qin, and J. Domingo-Ferrer, “Asymmetric group key agreement,” in Proceedings of Euro Crypt 2009, cologne, pp. 153-170, April (2009), Germany.(CrossRef)(Google Scholar)
[11] D. Boneh and H. Shacham, “Group signatures with verifier local revocation,” in Proceedings of ACM CCS, pp. 168-177, October (2004), DC, USA.(CrossRef)(Google Scholar)
[12] D. Boneh, B. Lynn, and H. Shacham, “Short signatures from the weil pairing,” in Proceedings of Asiacrypt 2001, pp. 514-532, December (2001), Gold Coast, Australia.(CrossRef)(Google Scholar)
[13] D. Boneh and X. Boyen, “Collision-free accumulators and fail stop signature schemes without trees,” in Proceedings of Euro Crypt 2004, pp. 56-73, May (2004), Interlaken, Switzerland.
[14] N. Baric and B. Pfitzman, “Collision-free accumulators and failstop signature schemes without trees,” in Proceedings of Euro- Crypt 1997, pp. 480-494, May (1997), Konstanz, Germany.(CrossRef)(Google Scholar)